An active set algorithm for tracing parametrized optima
نویسندگان
چکیده
منابع مشابه
An active set algorithm for nonlinear optimization with polyhedral constraints
A polyhedral active set algorithm PASA is developed for solving a nonlinear optimization problem whose feasible set is a polyhedron. Phase one of the algorithm is the gradient projection method, while phase two is any algorithm for solving a linearly constrained optimization problem. Rules are provided for branching between the two phases. Global convergence to a stationary point is established...
متن کاملAn Implementable Active - Set Algorithm for Computing aB - Stationary
We consider a mathematical program with smooth objective function and linear inequality/complementarity constraints. We propose an-active set algorithm which, under a uniform LICQ on the-feasible set, generates iterates whose cluster points are B-stationary points of the problem. If the objective function is quadratic and is set to zero, the algorithm terminates nitely. Some numerical experienc...
متن کاملA Parametrized Algorithm for Matroid Branch-Width
Branch-width is a structural parameter very closely related to tree-width, but branch-width has an immediate generalization from graphs to matroids. We present an algorithm that, for a given matroid M of bounded branch-width t which is represented over a finite field, finds a branch decomposition of M of width at most 3t in cubic time. Then we show that the branch-width of M is a uniformly fixe...
متن کاملGenetic Algorithm to Set Active Contour
Active contours, very popular in image segmentation, suffer from delicate adjustments of many parameters. We propose to carry out these adjustments using genetic algorithm. Here an active contour is implemented using a greedy algorithm. Within this framework, two approaches are presented. A supervised approach which delivers a global set of parameters. In this case the greedy algorithm is invol...
متن کاملA New Active Set Algorithm for Box Constrained Optimization
An active set algorithm (ASA) for box constrained optimization is developed. The algorithm consists of a nonmonotone gradient projection step, an unconstrained optimization step, and a set of rules for branching between the two steps. Global convergence to a stationary point is established. For a nondegenerate stationary point, the algorithm eventually reduces to unconstrained optimization with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Structural Optimization
سال: 1991
ISSN: 0934-4373,1615-1488
DOI: 10.1007/bf01743487